An Adaptive Hash Join Algorithm on a Network of Workstations
نویسندگان
چکیده
Due to advances in computer technology, many organizations have a large number of workstation-class machines connected by LAN. Such a network of workstations (NOW) can be used for parallel processing, including database query processing. This paper proposes a new load sharing algorithm for hash join processing on NOWs. This new algorithm combines a chunking method with hash join to manage dynamic changes that occur in NOW environments. The algorithm is compared with two other algorithms: an adaptive nested-loop join and the adaptive GRACE hash join. These three algorithms were evaluated on a Pentiumbased heterogeneous NOW system with skewed data and various non-query background loads. The results show that the new algorithm is the best among the three in most of the cases and should be used for single join processing on NOWs.
منابع مشابه
Pipelined Hash Joins Using Network of Workstations
Drrnands for h ish transaction procrssing rates from databasc systsms Ird to the use of parallel processing techniqiiçs for transxtions and queries. Most commercial parallel database systems suffer from sxceptionally high hardware and software costs. Availùbility of public domain software (such as PVM and MPI) that hnmcsses several workstations on a LXN into a vinual pardlel machine provides a ...
متن کاملDiscussion Paper: Privacy-Preserving Distributed Queries for a Clinical Case Research Network
We present the motivation, use-case and requirements of a clinical case research network that would allow biomedical researchers to perform retrospective analysis on de-identified clinical cases joined across a large scale (nationwide) distributed network. Based on semi-join adaptive plans for fusion-queries, in this paper we discuss how joining can be done in a way that protects the privacy of...
متن کاملAn Adaptive Hash Join Algorithm for Multiuser Environments
As main memory becomes a cheaper resource, hash joins are an alternative to the traditional methods of performing equi-joins: nested loop and merge joins. This paper introduces a modified, adaptive hash join method that is designed to work with dynamic changes in the amount of available memory. The general idea of the algorithm is to regulate resource usage of a hash join in a way that allows i...
متن کاملA New Trace Backing Algorithm and Circular List Join for Maximizing Streaming Data Join
An increasing number of database queries are executed by interactive users and applications. Since the user is waiting for the database to respond with an answer, the initial response time of producing the first results is very important. The user can process the first results while the database system efficiently completes the entire query. The state-of-art join algorithms are not ideal for th...
متن کاملEfficient Index-based Processing of Join Queries in DHTs
Massively distributed applications require the integration of heterogeneous data from multiple sources. Peer-to-peer (P2P) is one possible network model for these distributed applications and among P2P architectures, distributed hash table (DHT) is well known for its routing performance guarantees. Under a general distributed relational data model, join query operator, an essential component to...
متن کامل